Parseval’s identity and optimal transport maps

Regularity of Optimal Transport Maps

In the special case “cost=squared distance” on R, the problem was solved by Caffarelli [Caf1, Caf2, Caf3, Caf4], who proved the smoothness of the map under suitable assumptions on the regularity of the densities and on the geometry of their support. However, a major open problem in the theory was the question of regularity for more general cost functions, or for the case “cost=squared distance”...

Existence and Uniqueness of Optimal Transport Maps

Let (X, d,m) be a proper, non-branching, metric measure space. We show existence and uniqueness of optimal transport maps for cost written as non-decreasing and strictly convex functions of the distance, provided (X, d,m) satisfies a new weak property concerning the behavior of m under the shrinking of sets to points, see Assumption 1. This in particular covers spaces satisfying the measure con...

Regularity of optimal transport maps and applications

Optimal Transport Maps in Monge-Kantorovieh Problem

In the first part of the paper we briefly decribe the classical problem, raised by Monge in 1781, of optimal transportation of mass. We discuss also Kantorovich's weak solution of the problem, which leads to general existence results, to a dual formulation, and to necessary and sufficient optimality conditions. In the second part we describe some recent progress on the problem of the existence ...

Optimal Transport Maps in Monge-Kantorovich Problem

In the first part of the paper we briefly decribe the classical problem, raised by Monge in 1781, of optimal transportation of mass. We discuss also Kantorovich’s weak solution of the problem, which leads to general existence results, to a dual formulation, and to necessary and sufficient optimality conditions. In the second part we describe some recent progress on the problem of the existence ...